New candidates welcome! Possible winners with respect to the addition of new candidates

نویسندگان

  • Yann Chevaleyre
  • Jérôme Lang
  • Nicolas Maudet
  • Jérôme Monnot
  • Lirong Xia
چکیده

In voting contexts, some new candidates may show up in the course of the process. In this case, we may want to determinewhich of the initial candidates are possiblewinners, given that a fixed number k of new candidates will be added. We give a computational study of this problem, focusing on scoring rules, and we provide a formal comparison with related problems such as control via adding candidates or cloning. © 2012 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Possible Winners when New Candidates Are Added: The Case of Scoring Rules

In some voting situations, some new candidates may show up in the course of the process. In this case, we may want to determine which of the initial candidates are possible winners, given that a fixed number k of new candidates will be added. Focusing on scoring rules, we give complexity results for the above possible winner problem.

متن کامل

Optimizing Disparity Candidates Space in Dense Stereo Matching

In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...

متن کامل

Voting procedures with incomplete preferences

We extend the application of a voting procedure (usually defined on complete preference relations over candidates) when the voters’ preferences consist of partial orders. We define possible (resp. necessary) winners for a given partial preference profile R with respect to a given voting procedure as the candidates being the winners in some (resp. all) of the complete extensions of R. We show th...

متن کامل

Cloning in Elections: Finding the Possible Winners

We consider the problem of manipulating elections by cloning candidates. In our model, a manipulator can replace each candidate c by several clones, i.e., new candidates that are so similar to c that each voter simply replaces c in his vote with a block of these new candidates, ranked consecutively. The outcome of the resulting election may then depend on the number of clones as well as on how ...

متن کامل

Just How Many Languages Are There?

Optimality Theory assumes the candidate set generated for any given input is of infinite cardinality. If all of the candidates in the candidate set were potential winners (optimal candidates under some ranking), then OT would have predicted an infinite typology— there would be infinitely many possible languages. However, Samek-Lodovici and Prince (1999) have shown that in standard OT (with only...

متن کامل

ذخیره در منابع من

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Mathematical Social Sciences

دوره 64  شماره 

صفحات  -

تاریخ انتشار 2012